Sharp ULP rounding error bound for the hypotenuse function

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp ULP rounding error bound for the hypotenuse function

The hypotenuse function, z = √ x2 + y2, is sometimes included in math library packages. Assuming that it is being computed by a straightforward algorithm, in a binary floating point environment, with round to nearest rounding mode, a sharp roundoff error bound is derived, for arbitrary precision. For IEEE single precision, or higher, the bound implies that |z − z| < 1.222 ulp(z) and |z − z| < 1...

متن کامل

A Sharp Lower Bound for Mixed-membership

The goal is to estimate {πi, 1 ≤ i ≤ n} (i.e., membership estimation). We model the network with the degree-corrected mixed membership (DCMM) model [8]. Since for many natural networks, the degrees have an approximate power-law tail, we allow severe degree heterogeneity in our model. For any membership estimation {π̂i, 1 ≤ i ≤ n}, since each πi is a probability mass function, it is natural to me...

متن کامل

A sharp isoperimetric bound for convex bodies

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp for all set sizes, dimensions, and norms. In the case of uniform density a stronger theorem is shown which is also sharp.

متن کامل

A Sharp Bound on the s-Energy

We derive an (essentially) optimal bound of O(1/ρs)n−1 on the s-energy of an n-agent averaging system, where ρ is a lower bound on the nonzero weights. The s-energy is a generating function with applications to opinion dynamics, synchronization, consensus, bird flocking, inhomogeneous products of stochastic matrices, etc. We discuss a few of the improvements one can derive from the new bounds.

متن کامل

Computation of the error function erf in arbitrary precision with correct rounding ∗

In this paper, the computation of erf(x) in arbitrary precision is detailed. A feature of our implementation is correct rounding: the returned result is the exact result (as if it were computed with infinite precision) rounded according to the specified rounding mode. The four rounding modes given in the IEEE-754 standard for floating-point arithmetic are provided. The algorithm that computes t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-01103-5